An Iterative Algorithm for Nonlinear Inverse Problems with Joint Sparsity Constraints in Vector Valued Regimes and an Application to Color Image Inpainting

نویسندگان

  • Gerd Teschke
  • Ronny Ramlau
چکیده

This paper is concerned with nonlinear inverse problems where data and solution are vector valued and, moreover, where the solution is assumed to have a sparse expansion with respect to a preassigned frame. We especially focus on such problems where the different components of the solution exhibit a common or so–called joint sparsity pattern. Joint sparsity means here that the measure (typically constructed as weighted `1 norms of componentwise `q norms of the frame coefficients) promotes a coupling of non–vanishing components. Quite recently, an iterative strategy for linear inverse problems with such joint sparsity constraints was presented. Here we develop an iterative concept for nonlinear inverse problems with joint sparsity constraints for which we show convergence and regularization properties. Moreover, we demonstrate the capabilities of the proposed algorithm in the field of color image inpainting. MSC: 15A29, 47A52, 68U10, 94A08, 94A40

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recovery Algorithms for Vector-Valued Data with Joint Sparsity Constraints

Vector valued data appearing in concrete applications often possess sparse expansions with respect to a preassigned frame for each vector component individually. Additionally, different components may also exhibit common sparsity patterns. Recently, there were introduced sparsity measures that take into account such joint sparsity patterns, promoting coupling of non-vanishing components. These ...

متن کامل

فشرده‌سازی تصویر با کمک حذف و کدگذاری هوشمندانه اطلاعات تصویر و بازسازی آن با استفاده از الگوریتم های ترمیم تصویر

Compression can be done by lossy or lossless methods. The lossy methods have been used more widely than the lossless compression. Although, many methods for image compression have been proposed yet, the methods using intelligent skipping proper to the visual models has not been considered in the literature. Image inpainting refers to the application of sophisticated algorithms to replace lost o...

متن کامل

Electric current density imaging via an accelerated iterative algorithm with joint sparsity constraints

Many problems in applied sciences require to spatially resolve an unknown electrical current distribution from its external magnetic field. Electric currents emit magnetic fields which can be measured by sophisticated superconducting devices in a noninvasive way. Applications of this technique arise in several fields, such as medical imaging and non-destructive testing, and they involve the sol...

متن کامل

Adaptive Iterative Thresholding Algorithms for Magnetoenceophalography (MEG)

We provide fast and accurate adaptive algorithms for the spatial resolution of current densities in MEG. We assume that vector components of the current densities possess a sparse expansion with respect to preassigned wavelets. Additionally, different components may also exhibit common sparsity patterns. We model MEG as an inverse problem with joint sparsity constraints, promoting coupling of n...

متن کامل

A Class of nonlinear $(A,eta)$-monotone operator inclusion problems with iterative algorithm and fixed point theory

A new class of nonlinear set-valued variationalinclusions involving $(A,eta)$-monotone mappings in a Banachspace setting is introduced, and then based on the generalizedresolvent operator technique associated with$(A,eta)$-monotonicity, the existence and approximationsolvability of solutions using an iterative algorithm and fixedpint theory is investigated.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007